Eigenvectors and Functions of the Discrete Fourier Transform
نویسنده
چکیده
A method is presented for computing an orthonormal set of eigenvectors for the discrete Fourier transform (DFT). The technique is based on a detailed analysis of the eigenstructure of a special matrix which commutes with the DFT. It is also shown how fractional powers of the DFT can be efficiently computed, and possible applications to multiplexing and transform coding are suggested. T
منابع مشابه
An Efficient Hamiltonian for Discrete Fractional Fourier Transform
Fractional Fourier Transform, which is a generalization of the classical Fourier Transform, is a powerful tool for the analysis of transient signals. The discrete Fractional Fourier Transform Hamiltonians have been proposed in the past with varying degrees of correlation between their eigenvectors and Hermite Gaussian functions. In this paper, we propose a new Hamiltonian for the discrete Fract...
متن کاملExplicit Hermite-type Eigenvectors of the Discrete Fourier Transform
The search for a canonical set of eigenvectors of the discrete Fourier transform has been ongoing for more than three decades. The goal is to find an orthogonal basis of eigenvectors which would approximate Hermite functions – the eigenfunctions of the continuous Fourier transform. This eigenbasis should also have some degree of analytical tractability and should allow for efficient numerical c...
متن کاملInteresting eigenvectors of the Fourier transform
It is well known that a function can be decomposed uniquely into the sum of an odd and an even function. This notion can be extended to the unique decomposition into the sum of four functions – two of which are even and two odd. These four functions are eigenvectors of the Fourier Transform with four different eigenvalues. That is, the Fourier transform of each of the four components is simply ...
متن کاملEigenvectors of the Discrete Fourier Transform Based on the Bilinear Transform
Determining orthonormal eigenvectors of the DFT matrix, which is closer to the samples of Hermite-Gaussian functions, is crucial in the definition of the discrete fractional Fourier transform. In this work, we disclose eigenvectors of the DFT matrix inspired by the ideas behind bilinear transform. The bilinear transform maps the analog space to the discrete sample space. As jω in the analog s-d...
متن کاملLectures 15: Cayley Graphs of Abelian Groups
In which we show how to find the eigenvalues and eigenvectors of Cayley graphs of Abelian groups, we find tight examples for various results that we proved in earlier lectures, and, along the way, we develop the general theory of harmonic analysis which includes the Fourier transform of periodic functions of a real variable, the discrete Fourier transform of periodic functions of an integer var...
متن کامل